import java.util.Scanner;
import java.io.BufferedInputStream;

public class Demo16 {
    static void quickSort(int[] q, int l, int r){
        if(l >= r)return;
        int x = q[l + r >> 1],i = l - 1, j = r + 1;
        while(i < j){
            do i++; while(q[i] < x);
            do j--; while(q[j] > x);

            if(i < j){
                int t = q[i];
                q[i] = q[j];
                q[j] = t;
            }
        }
        quickSort(q, l, j);
        quickSort(q, j + 1, r);

    }
    public static void main(String[] args){
        Scanner scan = new Scanner(new BufferedInputStream(System.in));

        int n = scan.nextInt();
        int[] q = new int[n];

        for(int i = 0; i < n; i++)q[i] = scan.nextInt();

        quickSort(q, 0, n - 1);

        for(int i = 0; i < n; i++)System.out.print(q[i] + " ");
    }
}